Full Abstraction for Fair Testing in CCS
نویسنده
چکیده
In previous work with Pous, we defined a semantics for CCS which may both be viewed as an innocent presheaf semantics and as a concurrent game semantics. It is here proved that a behavioural equivalence induced by this semantics on CCS processes is fully abstract for fair testing equivalence. The proof relies on a new algebraic notion called playground, which represents the ‘rule of the game’. From any playground, two languages, equipped with labelled transition systems, are derived, as well as a strong, functional bisimulation between them.
منابع مشابه
Full abstraction for fair testing in CCS (expanded version)
In previous work with Pous, we defined a semantics for CCS which may both be viewed as an innocent form of presheaf semantics and as a concurrent form of game semantics. We define in this setting an analogue of fair testing equivalence, which we prove fully abstract w.r.t. standard fair testing equivalence. The proof relies on a new algebraic notion called playground, which represents the ‘rule...
متن کاملFair Testing
Abs t rac t . We investigate the notion of fair testing, a formal testing theory in the style of De Nicola and Hennessy, where divergences are disregarded as long as there axe visible outgoing transitions. The usual testing theories, such as the standard model of failure pre-order, do not allow such fair interpretations because of the way in which they ensure their compositionality with respect...
متن کاملDeconstructing CCS and CSP Asynchronous Communication, Fairness, and Full Abstraction
The process algebras CCS and CSP assume that processes interact by means of handshake communication, although it would have been equally reasonable to have adopted asynchronous communication as primitive. Traditional semantics of CCS (based on bisimulation) and CSP (such as the failures model) do not assume fair parallel composition, although fairness is often vital in ensuring liveness propert...
متن کاملCCS: It's not Fair! Fair Schedulers cannot be implemented in CCS-like languages even under progress and certain fairness assumptions
In the process algebra community it is sometimes suggested that, on some level of abstraction, any distributed system can be modelled in standard process-algebraic specification formalisms like CCS. This sentiment is strengthened by results testifying that CCS, like many similar formalisms, is Turing powerful and provides a mechanism for interaction. This paper counters that sentiment by presen...
متن کاملInnocent strategies as presheaves and interactive equivalences for CCS
Seeking a general framework for reasoning about and comparing programming languages, we derive a new view of Milner’s CCS [33]. We construct a category E of plays, and a subcategory V of views. We argue that presheaves on V adequately represent innocent strategies, in the sense of game semantics [20]. We equip innocent strategies with a simple notion of interaction. We then prove decomposition ...
متن کامل